Some new models for multiprocessor interconnection networks
نویسندگان
چکیده
منابع مشابه
Multiprocessor Interconnection Networks
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into grou...
متن کاملGraphs for small multiprocessor interconnection networks
Let D be the diameter of a graph G and let λ1 be the largest eigenvalue of its (0,1)adjacency matrix. We give a proof of the fact that there are exactly 69 non-trivial connected graphs with (D + 1)λ1 9. These 69 graphs all have up to 10 vertices and were recently found to be suitable models for small multiprocessor interconnection networks. We also examine the suitability of integral graphs to ...
متن کاملOn Bandwidth Capabilites of Multiprocessor Interconnection Networks
In this paper the general characteristics and bandwidth capabilities of Multiprocessor Interconnection Networks have been analyzed. We have examined some popular FT(Four Tree)[8],MFT(Modified Four Tree)[2],THN(Theta Network)[13],NFT(New Four Tree)[4], IFT(Improved Four Tree)[5], IASN(Irregular Augmented Shuffle Network)[14] and IIASN(Improved Irregular Augmented Shuffle Netwrok) [3] networks wh...
متن کاملPerformance of multiprocessor interconnection networks - Computer
w ith device characterist ics approaching physical limits, parallel or distributed processing has been widely advocated as a promising approach for building high performance computing systems. The continued impetus in research in these areas arises from two factors: (a) the technological development in the areaof VLSI chips and (b) the observation that significant exploitable software paralleli...
متن کاملPower Constrained Design of Multiprocessor Interconnection Networks
[6] W. J. Dally, " Performance Analysis of k-ary n-cube interconnection networks, " IEEE Transactions on Computers, June 1990.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2016
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor160315020c